Finding the Median (Obliviously) with Bounded Space
نویسندگان
چکیده
We prove that any oblivious algorithm using space S to find the median of a list of n integers from {1, . . . , 2n} requires time Ω(n log logS n). This bound also applies to the problem of determining whether the median is odd or even. It is nearly optimal since Chan, following Munro and Raman, has shown that there is a (randomized) selection algorithm using only s registers, each of which can store an input value or O(logn)-bit counter, that makes only O(log logs n) passes over the input. The bound also implies a size lower bound for read-once branching programs computing the low order bit of the median and implies the analog of P 6= NP ∩ coNP for length o(n log logn) oblivious
منابع مشابه
Nonlinear Viscosity Algorithm with Perturbation for Nonexpansive Multi-Valued Mappings
In this paper, based on viscosity technique with perturbation, we introduce a new non-linear viscosity algorithm for finding a element of the set of fixed points of nonexpansivemulti-valued mappings in a Hilbert space. We derive a strong convergence theorem for thisnew algorithm under appropriate assumptions. Moreover, in support of our results, somenumerical examples (u...
متن کاملAdmissible and Minimax Estimator of the Parameter $theta$ in a Binomial $Bin( n ,theta)$ distribution under Squared Log Error Loss Function in a Lower Bounded Parameter Space
Extended Abstract. The study of truncated parameter space in general is of interest for the following reasons: 1.They often occur in practice. In many cases certain parameter values can be excluded from the parameter space. Nearly all problems in practice have a truncated parameter space and it is most impossible to argue in practice that a parameter is not bounded. In truncated parameter...
متن کاملTruncated Linear Minimax Estimator of a Power of the Scale Parameter in a Lower- Bounded Parameter Space
Minimax estimation problems with restricted parameter space reached increasing interest within the last two decades Some authors derived minimax and admissible estimators of bounded parameters under squared error loss and scale invariant squared error loss In some truncated estimation problems the most natural estimator to be considered is the truncated version of a classic...
متن کاملOn lattice of basic z-ideals
For an f-ring with bounded inversion property, we show that , the set of all basic z-ideals of , partially ordered by inclusion is a bounded distributive lattice. Also, whenever is a semiprimitive ring, , the set of all basic -ideals of , partially ordered by inclusion is a bounded distributive lattice. Next, for an f-ring with bounded inversion property, we prove that is a complemented...
متن کاملON FELBIN’S-TYPE FUZZY NORMED LINEAR SPACES AND FUZZY BOUNDED OPERATORS
In this note, we aim to present some properties of the space of all weakly fuzzy bounded linear operators, with the Bag and Samanta’s operator norm on Felbin’s-type fuzzy normed spaces. In particular, the completeness of this space is studied. By some counterexamples, it is shown that the inverse mapping theorem and the Banach-Steinhaus’s theorem, are not valid for this fuzzy setting. Also...
متن کامل